Energy Efficiency Improvement through Optimal Batch Sizing in Job Shop
نویسندگان
چکیده
منابع مشابه
Multiple Batch Sizing through Batch Size Smoothing
Batch sizing in different planning period is categorized as a classical problem in production planning, that so many exact & heuristic methods have been proposed to solve this problem, each of which considering various aspects of the original problem. The solution obtained from majority – e.g. MRP – is in this format that there may be some periods of idleness or each period should produce a...
متن کاملA metaheuristic technique for energy-efficiency in job-shop scheduling
Many real-world scheduling problems are solved to obtain optimal solutions in term of processing time, cost and quality as optimization objectives. Currently, energy-efficiency is also taking into consideration in these problems. However, this problem is NP-Hard, so many search techniques are not able to obtain a solution in a reasonable time. In this paper, a genetic algorithm is developed to ...
متن کاملFuzzy job shop scheduling with lot-sizing
This paper deals with a problem of determining lot-sizes of jobs in a real-world job shop-scheduling in the presence of uncertainty. The main issue discussed in this paper is lot-sizing of jobs. A fuzzy rule-based system is developed which determines the size of lots using the following premise variables: size of the job, the static slack of the job, workload on the shop floor, and the priority...
متن کاملmultiple batch sizing through batch size smoothing
batch sizing in different planning period is categorized as a classical problem in production planning, that so many exact & heuristic methods have been proposed to solve this problem, each of which considering various aspects of the original problem. the solution obtained from majority – e.g. mrp – is in this format that there may be some periods of idleness or each period should produ...
متن کاملOptimal job insertion in the no-wait job shop
The No-Wait Job Shop (NWJS) considered here is a version of the job shop scheduling problem where, for any two operations of a job, a fixed time lag between their starting times is given. Also, sequence-dependent set-up times between consecutive operations on a machine can be present. The NWJS problem consists in finding a schedule that minimizes the makespan. We address here the so-called Opti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Modern Applied Science
سال: 2020
ISSN: 1913-1852,1913-1844
DOI: 10.5539/mas.v14n10p6